Verifying Integrity of Decision Diagrams
نویسنده
چکیده
Decision Diagrams (DDs) are the state-of-the-art data structure in CAD of integrated circuits. They are used in many safety critical applications, like veriication. In this paper security aspects of implementation techniques of DDs are discussed. A recursive checksum technique is presented for on-line and oo-line checks. These methods are used to verify the integrity of DDs. The correctness of the data structures can be veriied by (nearly) no overhead. Experimental results are presented to demonstrate the eeciency of this approach.
منابع مشابه
Word Level Symbolic Model Checking A New Approach for Verifying Arithmetic Circuits
The highly-publicized division error in the Pentium has emphasized the importance of formal verification of arithmetic operations. Symbolic model checking techniques based on binary decision diagrams (BDDs) have been successful in verifying control logic. However, lack of proper representation for functions that map boolean vectors into integers has prevented this technique from being used for ...
متن کاملDistributed Binary Decision Diagrams for Veriication of Large Circuits 1
Binary Decision Diagrams are widely used for eeciently representing logic designs and for verifying their equivalence. They usually require large amounts of memory even for relatively small circuits. This paper presents a new mechanism for alleviating this problem by exploiting the memory available in a cluster of workstations. All the memory required for each node may be allocated in other mac...
متن کاملExtracting Propositional Rules from Feed-forward Neural Networks by Means of Binary Decision Diagrams
We discuss how to extract symbolic rules from a given binary threshold feed-forward network. The proposed decompositional approach is based on an internal representation using binary decision diagrams. They allow for an efficient composition of the intermediate results as well as for an easy integration of integrity constraints into the extraction. We also discuss some experimental results indi...
متن کاملBoolean Expression Diagrams ( Appears in LICS ' 97 )
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One...
متن کاملVeri cation of the MDG Components Library in HOL
The MDG system is a decision diagram based veri cation tool, primarily designed for hardware veri cation. It is based on Multiway decision diagrams|an extension of the traditional ROBDD approach. In this paper we describe the formal veri cation of the component library of the MDG system, using HOL. The hardware component library, whilst relatively simple, has been a source of errors in an earli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Integration
دوره 32 شماره
صفحات -
تاریخ انتشار 1998